Enhanced MENTOR Algorithm with ECMP Routing Enable

نویسندگان

  • Kairat Jaroenrat
  • Pisit Charnkeitkong
چکیده

MENTOR (Mesh Network Topological Optimization and Routing) is an efficient heuristic design algorithm network that assigns traffic flow while selecting links to be installed. MENTOR is suitable to design networks categorized as virtual circuit packet switching such as Frame Relay, ATM and MPLS networks. However, MENTOR cannot be directly applied to datagram packet switching networks such as purely IP router network. This is because the traffic flows determined by original MENTOR are not always the shortest path routing based on IP link weight assignment. To solve this problem, Cahn proposed a modified version of MENTOR called MENTOR-II in which appropriate link weights are assigned to the installed links such that the traffic always route on the path with minimum distance. However, it should be noted that the traffic flows assigned by MENTOR-II are limited to a single path routing. This study proposed a new modified version of MENTOR called Enhance-MENTOR, or EMENTOR, which is able to assign traffic with the Equal Cost Multi-Path (ECMP) routing. Three options of E-MENTOR are considered, i.e. E-MENTOR with single path routing only, E-MENTOR with ECMP routing only and E-MENTOR that consider ECMP routing if benefit. The three options of E-MENTOR are evaluated in term of installation cost, routing cost and reliability for 729 network design conditions. The design results are compared with those of original MENTOR and MENTOR-II.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient algorithm to enable path diversity in link state routing networks

1389-1286/$ see front matter 2010 Elsevier B.V doi:10.1016/j.comnet.2010.11.005 ⇑ Corresponding author. E-mail addresses: [email protected] [email protected] (P. Francois), olivier.bonav (O. Bonaventure), [email protected] (S. Cateloin (J.-J. Pansiot). Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the n...

متن کامل

The Two Best First Hops algorithm (TBFH) An Efficient Algorithm to Enable Path Diversity in IP Newtorks

Multipath routing allows for load balancing and fast re-routing in order to improve the reliability and the efficiency of the network. Current IP routers only support Equal Cost MultiPath (ECMP) which guarantees that the forwarding paths do not contain loops. However, ECMP provides limited path diversity. In this paper, we present an efficient algorithm that allows routers to enable more path d...

متن کامل

Traffic Engineering with ECMP: An Algorithmic Perspective

To efficiently exploit network resources operators do traffic engineering (TE), i.e., adapt the routing of traffic to the prevailing demands. TE in large IP networks typically relies on configuring static link weights and splitting traffic between the resulting shortest-paths via the Equal-Cost-MultiPath (ECMP) mechanism. Yet, despite its vast popularity, crucial operational aspects of TE via E...

متن کامل

Independent Multicast Equal - Cost Multipath ( ECMP ) Redirect

A Protocol Independent Multicast (PIM) router uses the Reverse Path Forwarding (RPF) procedure to select an upstream interface and router in order to build forwarding state. When there are equal-cost multipaths (ECMPs), existing implementations often use hash algorithms to select a path. Such algorithms do not allow the spread of traffic among the ECMPs according to administrative metrics. This...

متن کامل

Trimming the Multipath for Efficient Dynamic Routing

Multipath routing is a trivial way to exploit the path diversity to leverage the network throughput. Technologies such as OSPF ECMP use all the available paths in the network to forward traffic, however, we argue that is not necessary to do so to load balance the network. In this paper, we consider multipath routing with only a limited number of end-to-end paths for each source and destination,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013